Termination w.r.t. Q of the following Term Rewriting System could be proven:
Q restricted rewrite system:
The TRS R consists of the following rules:
s(a) → a
s(s(x)) → x
s(f(x, y)) → f(s(y), s(x))
s(g(x, y)) → g(s(x), s(y))
f(x, a) → x
f(a, y) → y
f(g(x, y), g(u, v)) → g(f(x, u), f(y, v))
g(a, a) → a
Q is empty.
↳ QTRS
↳ DirectTerminationProof
Q restricted rewrite system:
The TRS R consists of the following rules:
s(a) → a
s(s(x)) → x
s(f(x, y)) → f(s(y), s(x))
s(g(x, y)) → g(s(x), s(y))
f(x, a) → x
f(a, y) → y
f(g(x, y), g(u, v)) → g(f(x, u), f(y, v))
g(a, a) → a
Q is empty.
We use [23] with the following order to prove termination.
Lexicographic path order with status [19].
Quasi-Precedence:
s1 > f2 > g2
Status: trivial